Process logic: Expressiveness, decidability, completeness
نویسندگان
چکیده
منابع مشابه
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be capt...
متن کاملCompleteness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly ordered sets of models of the underlying logic. This interpretation induces an entailment relation between sequence formulas which strongly depends on which orderings one wishes to consider. Some important classes are:...
متن کاملSeparability, Expressiveness, and Decidability in the Ambient Logic
The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the descriptive and discriminating power of AL, focusing on the equivalence on processes induced by the logic (=L). We consider MA, and two Turing complete subsets of it...
متن کاملExpressiveness, Decidability, and Undecidability of Interval Temporal Logic
Interval Temporal Logics are formalisms particularly suitable to express temporal properties. Unlike standard temporal logics, they use intervals, instead of points, as primitive ontological entities. The most studied propositional interval temporal logic is Halpern and Shoham’s Modal Logic of Time Intervals (HS for short). It features a modal operator for each possible ordering relation betwee...
متن کاملOn the Expressiveness and Decidability of Higher - Order Process
In higher-order process calculi, the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators necessary to express higher-order communications: input prefix, process output, and parallel composition. By exhibiting a deterministic encoding of Minsky machines, the calculus is shown to be Turing complete. Therefore ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1982
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90003-4